A note on Rabin's nearest-neighbor algorithm
نویسندگان
چکیده
منابع مشابه
A Note on Approximate Nearest Neighbor Methods
The references (e.g., Indyk and Motwani, 1999, Datar et al., 2004) contain extensive discussions of the complexity and applications of nearest neighbor algorithms and the motivations for introducing approximations. Complexity does not directly concern us in this paper, so we will not discuss it further; this paper is concerned with the utility and implications of the approximation scheme chosen...
متن کاملNearest Neighbor Search Algorithm
A fundamental activity common to image processing, pattern recognition, and clustering algorithm involves searching set of n , k-dimensional data for one which is nearest to a given target data with respect to distance function . Our goal is to find search algorithms with are full search equivalent -which is resulting match as a good as we could obtain if we were to search the set exhausting. 1...
متن کاملDrought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملAnalysis of a Nearest Neighbor Algorithm
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by many researchers. Our analysis assumes a conjunctive target concept, noise-free Boolean attributes, and a uniform distribution over the instance space. We calculate the probability that the algorithm will encounter a test instance that is distance d from the pr...
متن کاملA Hybrid Nearest-Neighbor and Nearest-Hyperrectangle Algorithm
Algorithms based on Nested Generalized Exemplar (NGE) theory 10] classify new data points by computing their distance to the nearest \generalized exemplar" (i.e. an axis-parallel multidimensional rectangle). An improved version of NGE, called BNGE, was previously shown to perform comparably to the Nearest Neighbor algorithm. Advantages of the NGE approach include compact representation of the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1979
ISSN: 0020-0190
DOI: 10.1016/0020-0190(79)90085-1